Algorithmic differentiation of hyperbolic flow problems

Multi-algorithmic Methods for Coupled Hyperbolic-parabolic Problems

This work is motivated by the study of flow and transport phenomena in highly heterogeneous porous media, an important application in the petroleum and environmental industries. An appealing technique for handling such phenomena is the use of a multi-algorithmic strategy based on the decomposition of the spatial domain into multiple non-overlapping subdomains according to the geological, physic...

Relatively hyperbolic groups: Intrinsic geometry, algebraic properties, and algorithmic problems

Open questions 100 1 Appendix. Equivalent definitions of relative hyperbolicity 103 Bibliography 108 2 Chapter 1 Introduction 1.1 Preliminary remarks Originally, the notion of a relatively hyperbolic group was proposed by Gromov [45] in order to generalize various examples of algebraic and geometric nature such as fundamental groups of finite–volume non–compact Riemannian mani-folds of pinched ...

Flow properties for Young{measure solutions of semilinear hyperbolic problems

For hyperbolic systems in one spatial dimension @ t u+C@ x u = f(u), u(t; x) 2 R d , we study sequences of oscillating solutions by their Young{measure limit and develop tools to study the evolution of directly from the Young measure of the initial data. For d 2 we construct a ow mapping S t such that (t) = S t () is the unique Young measure solution for initial value. For d 3 we establish exis...

Efficient Solvers for Incompressible Flow Problems: An Algorithmic Approach . . .

Algorithmic Properties of Relatively Hyperbolic Groups

The following discourse is inspired by the works on hyperbolic groups of Epstein, and Neumann/Reeves. In [E], it is shown that geometrically finite hyperbolic groups are biautomatic. In [NR1], it is shown that virtually central extensions of word hyperbolic groups are biautomatic. We prove the following generalisation: Theorem 1. Let H be a geometrically finite hyperbolic group. Let σ ∈ H(H) an...